On Duality of Multiobjective Rough Convex Programming Problems
نویسندگان
چکیده
منابع مشابه
Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملBenson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملGeneralized Invexity and Duality in Multiobjective Programming Problems
In this paper we consider a multiobjective optimization problem, and we prove Mond-Weir duality results under second-and higher-order conditions of the objective and constraint functions.
متن کاملSolving multiobjective linear programming problems using ball center of polytopes
Here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. The algorithm is to obtain a solution which approximately meets the decision maker's preferences. It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. Numerical examples and a simulation study are used to illu...
متن کاملOn Multiobjective Duality For Variational Problems
In this paper two types of duals are considered for a class of variational problems involving higher order derivatives. The duality results are derived without any use of optimality conditions. One set of results is based on MondWeir type dual that has the same objective functional as the primal problem but different constraints. The second set of results is based on a dual of an auxiliary prim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied & Computational Mathematics
سال: 2015
ISSN: 2168-9679
DOI: 10.4172/2168-9679.1000263